A Mathematical Perspective on Post-Quantum Cryptography
نویسندگان
چکیده
In 2016, the National Institute of Standards and Technology (NIST) announced an open competition with goal finding standardizing suitable algorithms for quantum-resistant cryptography. This study presents a detailed, mathematically oriented overview round-three finalists NIST’s post-quantum cryptography standardization consisting lattice-based key encapsulation mechanisms (KEMs) CRYSTALS-Kyber, NTRU SABER; code-based KEM Classic McEliece; signature schemes CRYSTALS-Dilithium FALCON; multivariate-based scheme Rainbow. The above-cited algorithm descriptions are precise technical specifications intended cryptographic experts. Nevertheless, documents not well-suited general interested mathematical audience. Therefore, main focus is put on algorithms’ corresponding algebraic foundations, in particular LWE problems, lattices, linear codes multivariate equation systems aim fostering broader understanding concepts behind
منابع مشابه
Quantum and Post Quantum Cryptography
Public key cryptography is widely used for signing contracts, electronic voting, encryption, and to secure transactions over the Internet. The discovery by Peter Shor, in 1994, of an efficient algorithm based on quantum mechanics for factoring large integers and computing discrete logarithms undermined the security assumptions upon which currently used public key cryptographic algorithms are ba...
متن کاملA Note on Quantum Security for Post-Quantum Cryptography
Shor’s quantum factoring algorithm and a few other efficient quantum algorithms break many classical crypto-systems. In response, people proposed post-quantum cryptography based on computational problems that are believed hard even for quantum computers. However, security of these schemes against quantum attacks is elusive. This is because existing security analysis (almost) only deals with cla...
متن کامل“ Post - Quantum Cryptography ”
1 Summary of the review In this review I present the book " Post-Quantum Cryptography ". This volume gives a detailed, technical-level treatment of the post-quantum cryptography universe. 2 Summary of the book When (if?) quantum computers of a big enough size will be available, most of the current public-key cryptography primitives based on number theory will be vulnerable. The " next generatio...
متن کاملCryptography from Post-Quantum Assumptions
In this thesis we present our contribution in the field of post-quantum cryptography. We introduce a new notion of weakly Random-Self-Reducible public-key cryptosystem and show how it can be used to implement secure Oblivious Transfer. We also show that two recent (Post-quantum) cryptosystems can be considered as weakly RandomSelf-Reducible. We introduce a new problem called Isometric Lattice P...
متن کاملQuantum Learning Algorithms and Post-Quantum Cryptography
Quantum algorithms have demonstrated promising speed-ups over classical algorithms in the context of computational learning theory despite the presence of noise. In this work, we give an overview of recent quantum speed-ups, revisit the Bernstein-Vazirani algorithm in a new learning problem extension over an arbitrary cyclic group and discuss recent applications in cryptography, such as the Lea...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics
سال: 2022
ISSN: ['2227-7390']
DOI: https://doi.org/10.3390/math10152579